#include <iostream>
#include <vector>
#include <string>

using namespace std;
struct TreeNode 
{
    int val;
    struct TreeNode* left;
    struct TreeNode* right;
    TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
};
vector<int> ans;
void dfs(TreeNode* root)
{
    if (root == nullptr)
    {
        return;
    }
    dfs(root->left);
    ans.push_back(root->val);
    dfs(root->right);
}
vector<int> inorderTraversal(TreeNode* root)
{
    // write code here
    dfs(root);
    return ans;
}
int main()
{

	return 0;
}